A Least-squares Method for Consistent Mesh Tying
نویسنده
چکیده
In the finite element method, a standard approach to mesh tying is to apply Lagrange multipliers. If the interface is curved, however, discretization generally leads to adjoining surfaces that do not coincide spatially. Straightforward Lagrange multiplier methods lead to discrete formulations failing a first-order patch test [12]. A least-squares method is presented here for mesh tying in the presence of gaps and overlaps. The least-squares formulation for transmission problems [5] is extended to settings where subdomain boundaries are not spatially coincident. The new method is consistent in the sense that it recovers exactly global polynomial solutions that are in the finite element space. As a result, the least-squares mesh tying method passes a patch test of the order of the finite element space by construction. This attractive computational property is illustrated by numerical experiments.
منابع مشابه
Incompressible laminar flow computations by an upwind least-squares meshless method
In this paper, the laminar incompressible flow equations are solved by an upwind least-squares meshless method. Due to the difficulties in generating quality meshes, particularly in complex geometries, a meshless method is increasingly used as a new numerical tool. The meshless methods only use clouds of nodes to influence the domain of every node. Thus, they do not require the nodes to be conn...
متن کاملExternal and Internal Incompressible Viscous Flows Computation using Taylor Series Expansion and Least Square based Lattice Boltzmann Method
The lattice Boltzmann method (LBM) has recently become an alternative and promising computational fluid dynamics approach for simulating complex fluid flows. Despite its enormous success in many practical applications, the standard LBM is restricted to the lattice uniformity in the physical space. This is the main drawback of the standard LBM for flow problems with complex geometry. Several app...
متن کاملGlobal least squares solution of matrix equation $sum_{j=1}^s A_jX_jB_j = E$
In this paper, an iterative method is proposed for solving matrix equation $sum_{j=1}^s A_jX_jB_j = E$. This method is based on the global least squares (GL-LSQR) method for solving the linear system of equations with the multiple right hand sides. For applying the GL-LSQR algorithm to solve the above matrix equation, a new linear operator, its adjoint and a new inner product are dened. It is p...
متن کاملOptimal Pareto Parametric Analysis of Two Dimensional Steady-State Heat Conduction Problems by MLPG Method
Numerical solutions obtained by the Meshless Local Petrov-Galerkin (MLPG) method are presented for two dimensional steady-state heat conduction problems. The MLPG method is a truly meshless approach, and neither the nodal connectivity nor the background mesh is required for solving the initial-boundary-value problem. The penalty method is adopted to efficiently enforce the essential boundary co...
متن کاملA FAST MESH-FREE GALERKIN METHOD FOR THE ANALYSIS OF STEADY-STATE HEAT TRANSFER
The element-free Galerkin method is employed for two-dimensional analysis of steady-state heat transfer. The unknown response of the system, i.e. temperature is approximated using the moving least squares technique. Numerical integration of governing simultaneous system of equations is performed by Gauss quadrature and new modified nodal integration techniques. Numerical examples and tests have...
متن کامل